A Sheaf Representation of Distributive Pseudocomplemented Lattices
نویسندگان
چکیده
منابع مشابه
Unification on Subvarieties of Pseudocomplemented Distributive Lattices
Syntactic unification theory is concerned with the problem of finding a substitution that equalises a finite set of pairs of terms simultaneously. More precisely, given a set of function symbols L and a finite set of pairs of L-terms U = {(t1, s1), . . . , (tm, sm)}, called a unification problem, a unifier for U is a substitution σ defined on the set of variables of the terms in U such that σ(t...
متن کاملThe Structure of Pseudocomplemented Distributive Lattices. I: Subdirect Decomposition
In this paper all subdirectly irreducible pseudocomplemented distributive lattices are found. This result is used to establish a Stone-like representation theorem conjectured by G. Grätzer and to find all equational subclasses of the class of pseudocomplemented distributive lattices.
متن کاملA Representation Theory for Modalized Distributive Lattices
By a lattice we shall always mean a distributive lattice which is bounded, i.e. has both a bottom element 0 and a top element 1. Lattice homomorphisms will always be assumed to preserve 0 and 1. By a modality on a (distributive) lattice L = (L, ∧, ∨, ≤, 0, 1) is meant a map : L → L satisfying (1) 1 = 1, (2) (x ∧ y) = x ∧ y for x, y ∈ L. The pair (L, ) will be called a modalized (distributive) l...
متن کاملOn the Representation of Finite Distributive Lattices
Classical results of Birkhoff and of Dilworth yield an extremely useful representation of a finite distributive lattice L as the downset lattice D(JL) of poset JL of join-irreducible elements of L. Through this they get a correspondence between the chain decompositions of JL and the tight embeddings of L into a product of chains. We use a simple but elegant result of Rival which characterizes s...
متن کاملRepresentation Theorem for Finite Distributive Lattices
1. INDUCTION IN A FINITE LATTICE Let L be a 1-sorted structure and let A, B be subsets of L. Let us observe that A⊆ B if and only if: (Def. 1) For every element x of L such that x ∈ A holds x ∈ B. Let L be a lattice. Observe that there exists a chain of L which is non empty. Let L be a lattice and let x, y be elements of L. Let us assume that x ≤ y. A non empty chain of L is called a x-chain of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1976
ISSN: 0002-9939
DOI: 10.2307/2040851